Employers’ Search and the Efficiency of Matching
نویسنده
چکیده
Employers’ Search and the Efficiency of Matching Unskilled workers in low productivity jobs typically experience higher labour turnover. This paper shows how this empirical finding is related to variation in the efficiency of the matching process across occupations. A simple theoretical model of employers’ search shows that firms find it optimal to invest relatively little in advertisement and screening when recruiting for low productivity jobs. This generates more separations and higher turnover at the bottom than at the top of the jobs’ distribution. The analysis of a unique sample of British hirings, containing detailed information about employers’ recruitment practices, shows that more intensive recruitment leads to matches of better quality that pay higher wages, last longer and make employers more satisfied with the person taken on. JEL Classification: J63, J64, M51
منابع مشابه
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملEmployers’ search and the e ciency of matching
Labour turnover is typically higher in low productivity jobs. This paper suggests that this empirical finding is due to the matching process being less e cient at the bottom than at the top of the jobs’ distribution. A simple theoretical model of employers’ search shows that firms find it optimal to invest relatively little in advertisement and screening for low productivity jobs. This generate...
متن کامل